Computing 2-terminal reliability of probe interval graphs
نویسندگان
چکیده
منابع مشابه
Computing 2-Terminal Reliability of Probe Interval Graphs
Consider a probabilistic graph G in which the edges are perfectly reliable, but vertices may fail with some known probabilities. The 2-terminal reliability of G is defined as the probability that one operational path exists between a given source and destination pair vertices of G. This 2-terminal reliability problem is known to be #P-complete for general graphs but solvable in polynomial time ...
متن کاملComputing the K-terminal Reliability of Circle Graphs
Let G denote a graph and let K be a subset of vertices that are a set of target vertices of G. The Kterminal reliability of G is defined as the probability that all target vertices in K are connected, considering the possible failures of non-target vertices of G. The problem of computing K-terminal reliability is known to be #P-complete for polygon-circle graphs, and can be solved in polynomial...
متن کاملCharacterizations of probe interval graphs
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bipartite graph from its adjacency matrix. Finally, we note that if we add a loop at every probe vertex of a probe interval graph, then the Ferrers dimension of the corresponding symmetric bipa...
متن کاملA characterization of 2-tree probe interval graphs
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P . We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by ...
متن کاملProbe interval graphs and probe unit interval graphs on superclasses of cographs
A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain a (unit) interval graph by adding edges with both endpoints in the set of nonprobe vertices. Probe (unit) interval graphs form a superclass of (unit) interval graphs. Probe int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Sciences
سال: 2015
ISSN: 1314-7552
DOI: 10.12988/ams.2015.410883